./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:34:50,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:34:50,754 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:34:50,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:34:50,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:34:50,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:34:50,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:34:50,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:34:50,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:34:50,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:34:50,799 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:34:50,800 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:34:50,800 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:34:50,800 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:34:50,800 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:34:50,800 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:34:50,801 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:34:50,801 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:34:50,801 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:34:50,801 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:34:50,802 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:34:50,802 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:34:50,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:34:50,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:34:50,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:34:50,803 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:34:50,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:34:50,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:34:50,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:34:50,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:34:50,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:34:50,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:34:50,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:34:50,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:34:50,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:34:50,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:34:50,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:34:50,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:34:50,808 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:34:50,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:34:50,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:34:50,808 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:34:50,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:34:50,809 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2024-11-14 05:34:51,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:34:51,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:34:51,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:34:51,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:34:51,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:34:51,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i Unable to find full path for "g++" [2024-11-14 05:34:53,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:34:54,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:34:54,185 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-11-14 05:34:54,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/data/7ff4cd50c/e2287eddf753439c835efb5d313e4e08/FLAG08edd9fcd [2024-11-14 05:34:54,240 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/data/7ff4cd50c/e2287eddf753439c835efb5d313e4e08 [2024-11-14 05:34:54,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:34:54,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:34:54,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:34:54,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:34:54,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:34:54,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:54" (1/1) ... [2024-11-14 05:34:54,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b4fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:54, skipping insertion in model container [2024-11-14 05:34:54,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:54" (1/1) ... [2024-11-14 05:34:54,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:34:54,930 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,001 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,011 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,019 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,028 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,086 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,086 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:34:55,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:34:55,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:34:55,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:34:55,373 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:34:55,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55 WrapperNode [2024-11-14 05:34:55,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:34:55,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:34:55,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:34:55,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:34:55,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,532 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-14 05:34:55,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:34:55,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:34:55,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:34:55,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:34:55,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:34:55,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:34:55,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:34:55,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:34:55,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (1/1) ... [2024-11-14 05:34:55,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:34:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:34:55,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:34:55,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:34:55,768 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 05:34:55,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 05:34:55,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:34:55,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:34:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:34:55,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 05:34:55,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:34:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:34:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:34:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:34:55,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:34:55,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:34:56,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:34:56,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:34:56,109 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 05:34:59,388 INFO L? ?]: Removed 1036 outVars from TransFormulas that were not future-live. [2024-11-14 05:34:59,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:35:01,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:35:01,631 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 05:35:01,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:01 BoogieIcfgContainer [2024-11-14 05:35:01,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:35:01,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:35:01,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:35:01,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:35:01,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:54" (1/3) ... [2024-11-14 05:35:01,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc4887d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:01, skipping insertion in model container [2024-11-14 05:35:01,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:55" (2/3) ... [2024-11-14 05:35:01,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc4887d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:01, skipping insertion in model container [2024-11-14 05:35:01,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:01" (3/3) ... [2024-11-14 05:35:01,650 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2024-11-14 05:35:01,672 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:35:01,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test2-1.i that has 4 procedures, 791 locations, 1 initial locations, 31 loop locations, and 424 error locations. [2024-11-14 05:35:01,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:35:01,774 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5551ef36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:35:01,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-14 05:35:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 791 states, 356 states have (on average 2.480337078651685) internal successors, (883), 784 states have internal predecessors, (883), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 05:35:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:35:01,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:01,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:35:01,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:35:01,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 66796, now seen corresponding path program 1 times [2024-11-14 05:35:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:01,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320370991] [2024-11-14 05:35:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:02,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320370991] [2024-11-14 05:35:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320370991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:02,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:35:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649337416] [2024-11-14 05:35:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:02,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:02,124 INFO L87 Difference]: Start difference. First operand has 791 states, 356 states have (on average 2.480337078651685) internal successors, (883), 784 states have internal predecessors, (883), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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) [2024-11-14 05:35:04,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:06,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:08,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:09,756 INFO L93 Difference]: Finished difference Result 777 states and 834 transitions. [2024-11-14 05:35:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:09,760 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 [2024-11-14 05:35:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:09,789 INFO L225 Difference]: With dead ends: 777 [2024-11-14 05:35:09,790 INFO L226 Difference]: Without dead ends: 776 [2024-11-14 05:35:09,792 INFO L431 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 [2024-11-14 05:35:09,797 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 710 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 468 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 463 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2024-11-14 05:35:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-14 05:35:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2024-11-14 05:35:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 359 states have (on average 2.2701949860724233) internal successors, (815), 769 states have internal predecessors, (815), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 05:35:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 833 transitions. [2024-11-14 05:35:09,919 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 833 transitions. Word has length 2 [2024-11-14 05:35:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 833 transitions. [2024-11-14 05:35:09,920 INFO L472 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) [2024-11-14 05:35:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 833 transitions. [2024-11-14 05:35:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 05:35:09,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:09,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 05:35:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:35:09,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:35:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 66797, now seen corresponding path program 1 times [2024-11-14 05:35:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:09,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709539840] [2024-11-14 05:35:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:09,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:10,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709539840] [2024-11-14 05:35:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709539840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:35:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981024602] [2024-11-14 05:35:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:10,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:10,057 INFO L87 Difference]: Start difference. First operand 776 states and 833 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) [2024-11-14 05:35:12,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:14,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:16,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:19,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:21,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:23,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:26,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:28,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:29,350 INFO L93 Difference]: Finished difference Result 1298 states and 1405 transitions. [2024-11-14 05:35:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:29,351 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 [2024-11-14 05:35:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:29,357 INFO L225 Difference]: With dead ends: 1298 [2024-11-14 05:35:29,357 INFO L226 Difference]: Without dead ends: 1298 [2024-11-14 05:35:29,358 INFO L431 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 [2024-11-14 05:35:29,359 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 554 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:29,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 903 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 736 Invalid, 8 Unknown, 0 Unchecked, 19.2s Time] [2024-11-14 05:35:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-14 05:35:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1035. [2024-11-14 05:35:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 614 states have (on average 2.221498371335505) internal successors, (1364), 1026 states have internal predecessors, (1364), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:35:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1396 transitions. [2024-11-14 05:35:29,398 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1396 transitions. Word has length 2 [2024-11-14 05:35:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:29,398 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1396 transitions. [2024-11-14 05:35:29,399 INFO L472 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) [2024-11-14 05:35:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1396 transitions. [2024-11-14 05:35:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:35:29,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:29,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:35:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:35:29,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:35:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1560010974, now seen corresponding path program 1 times [2024-11-14 05:35:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788008282] [2024-11-14 05:35:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:29,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788008282] [2024-11-14 05:35:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788008282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:35:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064607434] [2024-11-14 05:35:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:29,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:29,542 INFO L87 Difference]: Start difference. First operand 1035 states and 1396 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-14 05:35:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:33,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:35,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:38,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:40,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:42,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:42,762 INFO L93 Difference]: Finished difference Result 1192 states and 1561 transitions. [2024-11-14 05:35:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:42,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-14 05:35:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:42,768 INFO L225 Difference]: With dead ends: 1192 [2024-11-14 05:35:42,769 INFO L226 Difference]: Without dead ends: 1192 [2024-11-14 05:35:42,769 INFO L431 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 [2024-11-14 05:35:42,770 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 689 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 50 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:42,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 710 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 600 Invalid, 6 Unknown, 0 Unchecked, 13.2s Time] [2024-11-14 05:35:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-14 05:35:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 988. [2024-11-14 05:35:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 614 states have (on average 2.1058631921824102) internal successors, (1293), 979 states have internal predecessors, (1293), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:35:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1325 transitions. [2024-11-14 05:35:42,801 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1325 transitions. Word has length 6 [2024-11-14 05:35:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1325 transitions. [2024-11-14 05:35:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-14 05:35:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1325 transitions. [2024-11-14 05:35:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:35:42,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:42,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:35:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:35:42,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:35:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1560010975, now seen corresponding path program 1 times [2024-11-14 05:35:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242552882] [2024-11-14 05:35:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:42,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242552882] [2024-11-14 05:35:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242552882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:42,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:42,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:35:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995008790] [2024-11-14 05:35:42,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:42,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:35:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:35:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:35:42,985 INFO L87 Difference]: Start difference. First operand 988 states and 1325 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-14 05:35:45,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:47,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:50,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:52,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:35:52,668 INFO L93 Difference]: Finished difference Result 1294 states and 1755 transitions. [2024-11-14 05:35:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:35:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-14 05:35:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:35:52,678 INFO L225 Difference]: With dead ends: 1294 [2024-11-14 05:35:52,678 INFO L226 Difference]: Without dead ends: 1294 [2024-11-14 05:35:52,679 INFO L431 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 [2024-11-14 05:35:52,680 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 515 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:35:52,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 900 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 568 Invalid, 3 Unknown, 0 Unchecked, 9.6s Time] [2024-11-14 05:35:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-14 05:35:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 963. [2024-11-14 05:35:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 614 states have (on average 2.026058631921824) internal successors, (1244), 954 states have internal predecessors, (1244), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:35:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1276 transitions. [2024-11-14 05:35:52,724 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1276 transitions. Word has length 6 [2024-11-14 05:35:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:35:52,724 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1276 transitions. [2024-11-14 05:35:52,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-14 05:35:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1276 transitions. [2024-11-14 05:35:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:35:52,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:35:52,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:35:52,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:35:52,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:35:52,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:35:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 557206587, now seen corresponding path program 1 times [2024-11-14 05:35:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:35:52,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066554547] [2024-11-14 05:35:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:35:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:35:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:35:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:35:52,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:35:52,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066554547] [2024-11-14 05:35:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066554547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:35:52,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:35:52,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:35:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487097904] [2024-11-14 05:35:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:35:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:35:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:35:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:35:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:35:52,925 INFO L87 Difference]: Start difference. First operand 963 states and 1276 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 05:35:55,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:57,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:35:59,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:01,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:03,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:05,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:07,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:09,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:09,686 INFO L93 Difference]: Finished difference Result 1281 states and 1746 transitions. [2024-11-14 05:36:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:36:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-14 05:36:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:09,692 INFO L225 Difference]: With dead ends: 1281 [2024-11-14 05:36:09,692 INFO L226 Difference]: Without dead ends: 1281 [2024-11-14 05:36:09,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:09,693 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 222 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:09,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1848 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 6 Unknown, 0 Unchecked, 16.7s Time] [2024-11-14 05:36:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-11-14 05:36:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 965. [2024-11-14 05:36:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 616 states have (on average 2.022727272727273) internal successors, (1246), 956 states have internal predecessors, (1246), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:36:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1278 transitions. [2024-11-14 05:36:09,722 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1278 transitions. Word has length 9 [2024-11-14 05:36:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1278 transitions. [2024-11-14 05:36:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-14 05:36:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1278 transitions. [2024-11-14 05:36:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:36:09,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:09,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:09,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:36:09,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:36:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 467841397, now seen corresponding path program 1 times [2024-11-14 05:36:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281067872] [2024-11-14 05:36:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:36:09,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281067872] [2024-11-14 05:36:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281067872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:09,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:36:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221070451] [2024-11-14 05:36:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:36:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:36:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:36:09,812 INFO L87 Difference]: Start difference. First operand 965 states and 1278 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-14 05:36:11,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:15,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:18,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:20,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:20,864 INFO L93 Difference]: Finished difference Result 950 states and 1240 transitions. [2024-11-14 05:36:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:36:20,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-14 05:36:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:20,869 INFO L225 Difference]: With dead ends: 950 [2024-11-14 05:36:20,869 INFO L226 Difference]: Without dead ends: 950 [2024-11-14 05:36:20,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:20,871 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 725 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:20,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 625 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 821 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2024-11-14 05:36:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-14 05:36:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 942. [2024-11-14 05:36:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 616 states have (on average 1.948051948051948) internal successors, (1200), 933 states have internal predecessors, (1200), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:36:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1232 transitions. [2024-11-14 05:36:20,900 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1232 transitions. Word has length 14 [2024-11-14 05:36:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:20,901 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1232 transitions. [2024-11-14 05:36:20,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-14 05:36:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1232 transitions. [2024-11-14 05:36:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 05:36:20,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:20,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:36:20,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:36:20,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:36:20,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash 467841398, now seen corresponding path program 1 times [2024-11-14 05:36:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706170439] [2024-11-14 05:36:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:36:21,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706170439] [2024-11-14 05:36:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706170439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:21,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:21,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:36:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463705204] [2024-11-14 05:36:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:36:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:36:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:36:21,210 INFO L87 Difference]: Start difference. First operand 942 states and 1232 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-14 05:36:23,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:25,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:27,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:29,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:32,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:34,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:36,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:38,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:40,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:42,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:44,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:46,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:48,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:50,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:36:50,586 INFO L93 Difference]: Finished difference Result 1261 states and 1605 transitions. [2024-11-14 05:36:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:36:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-14 05:36:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:36:50,592 INFO L225 Difference]: With dead ends: 1261 [2024-11-14 05:36:50,592 INFO L226 Difference]: Without dead ends: 1261 [2024-11-14 05:36:50,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:36:50,593 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 610 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 24 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:36:50,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 974 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 966 Invalid, 13 Unknown, 0 Unchecked, 29.3s Time] [2024-11-14 05:36:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2024-11-14 05:36:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1032. [2024-11-14 05:36:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 706 states have (on average 1.8611898016997168) internal successors, (1314), 1023 states have internal predecessors, (1314), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:36:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1346 transitions. [2024-11-14 05:36:50,626 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1346 transitions. Word has length 14 [2024-11-14 05:36:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:36:50,627 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1346 transitions. [2024-11-14 05:36:50,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-14 05:36:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1346 transitions. [2024-11-14 05:36:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:36:50,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:36:50,629 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-14 05:36:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:36:50,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:36:50,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:36:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 302484655, now seen corresponding path program 1 times [2024-11-14 05:36:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:36:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966430713] [2024-11-14 05:36:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:36:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:36:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:36:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:36:51,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:36:51,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966430713] [2024-11-14 05:36:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966430713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:36:51,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:36:51,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:36:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836274431] [2024-11-14 05:36:51,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:36:51,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:36:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:36:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:36:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:36:51,028 INFO L87 Difference]: Start difference. First operand 1032 states and 1346 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-14 05:36:53,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:55,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:56,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:36:58,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:00,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:01,056 INFO L93 Difference]: Finished difference Result 889 states and 1154 transitions. [2024-11-14 05:37:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:37:01,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2024-11-14 05:37:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:01,060 INFO L225 Difference]: With dead ends: 889 [2024-11-14 05:37:01,060 INFO L226 Difference]: Without dead ends: 889 [2024-11-14 05:37:01,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:37:01,061 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 40 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:01,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1150 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 4 Unknown, 0 Unchecked, 10.0s Time] [2024-11-14 05:37:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-14 05:37:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2024-11-14 05:37:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 586 states have (on average 1.9146757679180888) internal successors, (1122), 880 states have internal predecessors, (1122), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:37:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1154 transitions. [2024-11-14 05:37:01,081 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1154 transitions. Word has length 30 [2024-11-14 05:37:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:01,082 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1154 transitions. [2024-11-14 05:37:01,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-11-14 05:37:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1154 transitions. [2024-11-14 05:37:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 05:37:01,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:01,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:01,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:37:01,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:37:01,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 380221845, now seen corresponding path program 1 times [2024-11-14 05:37:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449664797] [2024-11-14 05:37:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:01,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449664797] [2024-11-14 05:37:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449664797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:37:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:37:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:37:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742332916] [2024-11-14 05:37:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:37:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:37:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:37:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:37:01,316 INFO L87 Difference]: Start difference. First operand 889 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-14 05:37:03,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:05,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:07,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:09,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:11,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:13,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:14,026 INFO L93 Difference]: Finished difference Result 915 states and 1172 transitions. [2024-11-14 05:37:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:37:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 45 [2024-11-14 05:37:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:14,031 INFO L225 Difference]: With dead ends: 915 [2024-11-14 05:37:14,032 INFO L226 Difference]: Without dead ends: 915 [2024-11-14 05:37:14,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:37:14,032 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 36 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:14,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1703 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2024-11-14 05:37:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-14 05:37:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2024-11-14 05:37:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 610 states have (on average 1.8655737704918032) internal successors, (1138), 904 states have internal predecessors, (1138), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:37:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1170 transitions. [2024-11-14 05:37:14,055 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1170 transitions. Word has length 45 [2024-11-14 05:37:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:14,055 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1170 transitions. [2024-11-14 05:37:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-11-14 05:37:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1170 transitions. [2024-11-14 05:37:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 05:37:14,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:14,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:14,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:37:14,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:37:14,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -338074090, now seen corresponding path program 1 times [2024-11-14 05:37:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124689861] [2024-11-14 05:37:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:14,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124689861] [2024-11-14 05:37:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124689861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:37:14,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:37:14,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:37:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066400227] [2024-11-14 05:37:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:37:14,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:37:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:14,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:37:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:37:14,239 INFO L87 Difference]: Start difference. First operand 913 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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) [2024-11-14 05:37:16,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:18,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:20,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:22,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:24,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:26,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:28,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:30,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:31,021 INFO L93 Difference]: Finished difference Result 1193 states and 1554 transitions. [2024-11-14 05:37:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:37:31,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2024-11-14 05:37:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:31,025 INFO L225 Difference]: With dead ends: 1193 [2024-11-14 05:37:31,026 INFO L226 Difference]: Without dead ends: 1193 [2024-11-14 05:37:31,026 INFO L431 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 [2024-11-14 05:37:31,026 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 162 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:31,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1246 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 8 Unknown, 0 Unchecked, 16.8s Time] [2024-11-14 05:37:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-14 05:37:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1136. [2024-11-14 05:37:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 823 states have (on average 1.8213851761846902) internal successors, (1499), 1127 states have internal predecessors, (1499), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:37:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1551 transitions. [2024-11-14 05:37:31,057 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1551 transitions. Word has length 49 [2024-11-14 05:37:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:31,057 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1551 transitions. [2024-11-14 05:37:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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) [2024-11-14 05:37:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1551 transitions. [2024-11-14 05:37:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 05:37:31,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:31,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:37:31,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:37:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1913064889, now seen corresponding path program 1 times [2024-11-14 05:37:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765700347] [2024-11-14 05:37:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:31,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765700347] [2024-11-14 05:37:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765700347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:37:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:37:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:37:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467621168] [2024-11-14 05:37:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:37:31,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:37:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:37:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:37:31,670 INFO L87 Difference]: Start difference. First operand 1136 states and 1551 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-11-14 05:37:33,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:36,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:38,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:40,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:42,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:44,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:46,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:37:47,424 INFO L93 Difference]: Finished difference Result 1135 states and 1549 transitions. [2024-11-14 05:37:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:37:47,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-14 05:37:47,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:37:47,433 INFO L225 Difference]: With dead ends: 1135 [2024-11-14 05:37:47,433 INFO L226 Difference]: Without dead ends: 1135 [2024-11-14 05:37:47,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:37:47,434 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:37:47,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1601 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1121 Invalid, 6 Unknown, 0 Unchecked, 15.7s Time] [2024-11-14 05:37:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-14 05:37:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-14 05:37:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 823 states have (on average 1.818955042527339) internal successors, (1497), 1126 states have internal predecessors, (1497), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:37:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1549 transitions. [2024-11-14 05:37:47,460 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1549 transitions. Word has length 56 [2024-11-14 05:37:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:37:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1549 transitions. [2024-11-14 05:37:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-11-14 05:37:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1549 transitions. [2024-11-14 05:37:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 05:37:47,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:37:47,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:37:47,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:37:47,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:37:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:37:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1913064890, now seen corresponding path program 1 times [2024-11-14 05:37:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:37:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220640107] [2024-11-14 05:37:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:37:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:37:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:37:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:37:48,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:37:48,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220640107] [2024-11-14 05:37:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220640107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:37:48,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:37:48,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:37:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052974487] [2024-11-14 05:37:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:37:48,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:37:48,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:37:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:37:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:37:48,314 INFO L87 Difference]: Start difference. First operand 1135 states and 1549 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-11-14 05:37:50,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:52,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:54,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:56,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:37:58,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:01,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:03,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:05,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:07,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:08,003 INFO L93 Difference]: Finished difference Result 1134 states and 1547 transitions. [2024-11-14 05:38:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:38:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-14 05:38:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:08,011 INFO L225 Difference]: With dead ends: 1134 [2024-11-14 05:38:08,011 INFO L226 Difference]: Without dead ends: 1134 [2024-11-14 05:38:08,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:38:08,012 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 1 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:08,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1539 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 9 Unknown, 0 Unchecked, 19.6s Time] [2024-11-14 05:38:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-11-14 05:38:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2024-11-14 05:38:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 821 states have (on average 1.8209500609013398) internal successors, (1495), 1125 states have internal predecessors, (1495), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:38:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1547 transitions. [2024-11-14 05:38:08,044 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1547 transitions. Word has length 56 [2024-11-14 05:38:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:08,044 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1547 transitions. [2024-11-14 05:38:08,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 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) [2024-11-14 05:38:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1547 transitions. [2024-11-14 05:38:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:38:08,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:08,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:38:08,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:38:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 682152479, now seen corresponding path program 1 times [2024-11-14 05:38:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747745263] [2024-11-14 05:38:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:08,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:08,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747745263] [2024-11-14 05:38:08,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747745263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:08,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:08,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:38:08,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863458071] [2024-11-14 05:38:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:08,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:38:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:38:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:08,528 INFO L87 Difference]: Start difference. First operand 1134 states and 1547 transitions. Second operand has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-11-14 05:38:10,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:12,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:14,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:16,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:18,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:20,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:23,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:25,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:27,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:29,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:31,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:33,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:35,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:37,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:39,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:41,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:42,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:43,311 INFO L93 Difference]: Finished difference Result 1149 states and 1570 transitions. [2024-11-14 05:38:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:38:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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 62 [2024-11-14 05:38:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:43,318 INFO L225 Difference]: With dead ends: 1149 [2024-11-14 05:38:43,318 INFO L226 Difference]: Without dead ends: 1149 [2024-11-14 05:38:43,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:38:43,319 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 12 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 10 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:43,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2488 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1575 Invalid, 16 Unknown, 0 Unchecked, 34.7s Time] [2024-11-14 05:38:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-14 05:38:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1142. [2024-11-14 05:38:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 828 states have (on average 1.817632850241546) internal successors, (1505), 1131 states have internal predecessors, (1505), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-14 05:38:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1562 transitions. [2024-11-14 05:38:43,365 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1562 transitions. Word has length 62 [2024-11-14 05:38:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:43,366 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1562 transitions. [2024-11-14 05:38:43,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-11-14 05:38:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1562 transitions. [2024-11-14 05:38:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:38:43,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:43,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:38:43,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:38:43,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 682152480, now seen corresponding path program 1 times [2024-11-14 05:38:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417072075] [2024-11-14 05:38:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:44,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417072075] [2024-11-14 05:38:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417072075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:38:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:38:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:38:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116677019] [2024-11-14 05:38:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:38:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:38:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:38:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:38:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:38:44,242 INFO L87 Difference]: Start difference. First operand 1142 states and 1562 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-11-14 05:38:47,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:49,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:51,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:53,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:55,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:38:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:38:57,844 INFO L93 Difference]: Finished difference Result 1142 states and 1560 transitions. [2024-11-14 05:38:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:38:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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 62 [2024-11-14 05:38:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:38:57,851 INFO L225 Difference]: With dead ends: 1142 [2024-11-14 05:38:57,851 INFO L226 Difference]: Without dead ends: 1142 [2024-11-14 05:38:57,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:38:57,854 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 8 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:38:57,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1976 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1412 Invalid, 5 Unknown, 0 Unchecked, 13.5s Time] [2024-11-14 05:38:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-14 05:38:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2024-11-14 05:38:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 828 states have (on average 1.815217391304348) internal successors, (1503), 1131 states have internal predecessors, (1503), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-14 05:38:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1560 transitions. [2024-11-14 05:38:57,892 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1560 transitions. Word has length 62 [2024-11-14 05:38:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:38:57,893 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1560 transitions. [2024-11-14 05:38:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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) [2024-11-14 05:38:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1560 transitions. [2024-11-14 05:38:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:38:57,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:38:57,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:38:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:38:57,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:38:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:38:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -458342963, now seen corresponding path program 1 times [2024-11-14 05:38:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:38:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405415405] [2024-11-14 05:38:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:38:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:58,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:38:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405415405] [2024-11-14 05:38:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405415405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156715447] [2024-11-14 05:38:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:38:58,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:38:58,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:38:58,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:38:58,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:38:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:38:59,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:38:59,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:38:59,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:38:59,310 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:38:59,311 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 [2024-11-14 05:38:59,378 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 [2024-11-14 05:38:59,519 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 22 treesize of output 10 [2024-11-14 05:38:59,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:38:59,758 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 [2024-11-14 05:38:59,852 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 [2024-11-14 05:38:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:38:59,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:38:59,958 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 05:38:59,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156715447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:38:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881205223] [2024-11-14 05:38:59,995 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-14 05:38:59,996 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:39:00,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:39:00,007 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:39:00,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:39:07,347 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 05:39:07,794 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:42:25,266 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30889#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#length_619| (Array Int Int)) (|v_#valid_633| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= (select |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |#length| (store |v_#length_619| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= 40 (select |v_#length_619| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (select |v_#valid_633| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr228_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_18| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_18|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_int_427| (Array Int (Array Int Int))) (|v_#memory_int_426| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_424| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_427|) (= (store |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_3|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_424|) (= (store |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_426|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr228_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_18| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_18|))) (exists ((|v_#memory_$Pointer$.offset_305| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_306| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_308| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_305| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_306|) (= |v_#memory_$Pointer$.offset_308| (store |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_306| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_308| |ULTIMATE.start_main_~user~0#1.base|) 32)))))) (exists ((|v_#memory_int_427| (Array Int (Array Int Int))) (|v_#memory_int_426| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_422| (Array Int (Array Int Int))) (|v_#memory_int_424| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_427|) (= (store |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_422| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_424|) (= (store |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_424| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_426| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_426|) (= (store |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_427| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8))) |v_old(#memory_int)_AFTER_CALL_2|))) (exists ((|v_#memory_$Pointer$.base_309| (Array Int (Array Int Int))) (|v_#length_619| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#valid_633| (Array Int Int)) (|v_#memory_$Pointer$.base_312| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (and (= (store |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (<= 40 (select |v_#length_619| |ULTIMATE.start_main_~user~0#1.base|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= |v_#memory_$Pointer$.base_310| (store |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_309| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 36)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_633| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (select |v_#valid_633| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_312| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_312|) (= |#length| (store |v_#length_619| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)))))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= ~count_int_int~0 0) (= |ULTIMATE.start_main_#t~mem56#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-14 05:42:25,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:42:25,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:42:25,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-14 05:42:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207431262] [2024-11-14 05:42:25,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:42:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 05:42:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 05:42:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2613, Unknown=93, NotChecked=106, Total=3080 [2024-11-14 05:42:25,272 INFO L87 Difference]: Start difference. First operand 1142 states and 1560 transitions. Second operand has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:27,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:29,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:31,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:33,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:35,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:37,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:39,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:41,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:43,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:42:45,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:47,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:42:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:51,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:53,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:56,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:42:58,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:43:00,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:06,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:09,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:11,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:13,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:15,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:17,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:19,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:21,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:23,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:25,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:43:27,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:29,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:43:31,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:33,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:35,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:37,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:39,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:43:41,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:43:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:48,061 INFO L93 Difference]: Finished difference Result 1146 states and 1563 transitions. [2024-11-14 05:43:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:43:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2024-11-14 05:43:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:48,066 INFO L225 Difference]: With dead ends: 1146 [2024-11-14 05:43:48,066 INFO L226 Difference]: Without dead ends: 1146 [2024-11-14 05:43:48,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 198.2s TimeCoverageRelationStatistics Valid=300, Invalid=3033, Unknown=93, NotChecked=114, Total=3540 [2024-11-14 05:43:48,071 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 617 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 21 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:48,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 3875 Invalid, 4875 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4819 Invalid, 35 Unknown, 0 Unchecked, 82.3s Time] [2024-11-14 05:43:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-11-14 05:43:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2024-11-14 05:43:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 830 states have (on average 1.8120481927710843) internal successors, (1504), 1132 states have internal predecessors, (1504), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 05:43:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1558 transitions. [2024-11-14 05:43:48,098 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1558 transitions. Word has length 63 [2024-11-14 05:43:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:48,098 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1558 transitions. [2024-11-14 05:43:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.6875) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1558 transitions. [2024-11-14 05:43:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:43:48,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:48,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:48,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:43:48,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 05:43:48,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:43:48,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash -458342962, now seen corresponding path program 1 times [2024-11-14 05:43:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718331634] [2024-11-14 05:43:48,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:48,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:49,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718331634] [2024-11-14 05:43:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718331634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709187262] [2024-11-14 05:43:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:49,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:49,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:43:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:50,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:43:50,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:50,245 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 [2024-11-14 05:43:50,576 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 [2024-11-14 05:43:50,609 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:43:50,610 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 [2024-11-14 05:43:50,725 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 [2024-11-14 05:43:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:43:51,056 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 22 treesize of output 10 [2024-11-14 05:43:51,064 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 9 treesize of output 3 [2024-11-14 05:43:51,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:51,383 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 62 treesize of output 57 [2024-11-14 05:43:51,401 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 30 treesize of output 13 [2024-11-14 05:43:51,536 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 [2024-11-14 05:43:51,553 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 9 treesize of output 3 [2024-11-14 05:43:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:51,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:52,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_709 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:43:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709187262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133473454] [2024-11-14 05:43:52,047 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-14 05:43:52,047 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:52,048 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:52,048 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:52,048 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:58,524 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 130 for LOIs [2024-11-14 05:43:59,105 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:47:03,727 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33442#(and (<= 1 |#StackHeapBarrier|) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_623| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_638| (Array Int Int))) (and (= (select |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (select |v_#valid_638| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (= (store |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= |#length| (store |v_#length_623| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= 40 (select |v_#length_623| |ULTIMATE.start_main_~user~0#1.base|)))) (exists ((|v_#memory_int_445| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_446| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_#memory_int_443| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_446|) (= (store |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_445|) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_443|))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr228_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_30| 4294967296))))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#length_623| (Array Int Int)) (|v_#memory_$Pointer$.base_335| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_333| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_332| (Array Int (Array Int Int))) (|v_#valid_638| (Array Int Int))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 16 0) 12 0) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (select |v_#valid_638| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_335| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_335|) (= (select |v_#valid_638| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= (store |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_332| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_333| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_333|) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (<= 40 (select |v_#length_623| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#length_623| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_int_445| (Array Int (Array Int Int))) (|v_#memory_int_446| (Array Int (Array Int Int))) (|v_#memory_int_441| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_443| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_446|) (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_446| |ULTIMATE.start_main_~user~0#1.base|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_445| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_445|) (= (store |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_441| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_443| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_443|))) (exists ((|v_#memory_$Pointer$.offset_328| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_329| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_331| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_331| (store |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_331| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_328| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_329| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_329|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr228_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_30| 4294967296)))))) (or (< (+ 16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8) 20))) (<= 2 |ULTIMATE.start_main_~#i~0#1.base|) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= ~count_int_int~0 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0))' at error location [2024-11-14 05:47:03,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:47:03,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:47:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-14 05:47:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138629870] [2024-11-14 05:47:03,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:47:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 05:47:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:47:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 05:47:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2714, Unknown=97, NotChecked=108, Total=3192 [2024-11-14 05:47:03,731 INFO L87 Difference]: Start difference. First operand 1144 states and 1558 transitions. Second operand has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:12,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:14,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:16,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:20,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:22,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:24,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:26,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:30,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:32,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:47:34,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:36,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:38,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:40,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:42,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:45,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:47,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:49,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:47:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:57,169 INFO L93 Difference]: Finished difference Result 1145 states and 1561 transitions. [2024-11-14 05:47:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:47:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2024-11-14 05:47:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:57,174 INFO L225 Difference]: With dead ends: 1145 [2024-11-14 05:47:57,174 INFO L226 Difference]: Without dead ends: 1145 [2024-11-14 05:47:57,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 186.3s TimeCoverageRelationStatistics Valid=311, Invalid=3136, Unknown=97, NotChecked=116, Total=3660 [2024-11-14 05:47:57,176 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 605 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 5430 mSolverCounterSat, 23 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 5471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5430 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:57,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 2670 Invalid, 5471 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5430 Invalid, 18 Unknown, 0 Unchecked, 52.8s Time] [2024-11-14 05:47:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-14 05:47:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1135. [2024-11-14 05:47:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 823 states have (on average 1.8153098420413123) internal successors, (1494), 1125 states have internal predecessors, (1494), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:47:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1546 transitions. [2024-11-14 05:47:57,202 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1546 transitions. Word has length 63 [2024-11-14 05:47:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1546 transitions. [2024-11-14 05:47:57,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.133333333333334) internal successors, (107), 18 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:47:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1546 transitions. [2024-11-14 05:47:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:47:57,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:57,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:47:57,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:47:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:57,405 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:47:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1579966012, now seen corresponding path program 1 times [2024-11-14 05:47:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:47:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577202435] [2024-11-14 05:47:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:47:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:47:58,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:47:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577202435] [2024-11-14 05:47:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577202435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:58,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:58,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 05:47:58,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899169299] [2024-11-14 05:47:58,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:58,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:47:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:47:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:47:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:47:58,642 INFO L87 Difference]: Start difference. First operand 1135 states and 1546 transitions. Second operand has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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) [2024-11-14 05:48:01,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:03,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:05,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:07,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:12,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:17,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:19,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:23,901 INFO L93 Difference]: Finished difference Result 1150 states and 1567 transitions. [2024-11-14 05:48:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:48:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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 64 [2024-11-14 05:48:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:23,906 INFO L225 Difference]: With dead ends: 1150 [2024-11-14 05:48:23,906 INFO L226 Difference]: Without dead ends: 1150 [2024-11-14 05:48:23,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:48:23,907 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 618 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 3425 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3425 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:23,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2685 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3425 Invalid, 7 Unknown, 0 Unchecked, 24.9s Time] [2024-11-14 05:48:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-14 05:48:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1147. [2024-11-14 05:48:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 834 states have (on average 1.8081534772182255) internal successors, (1508), 1135 states have internal predecessors, (1508), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 05:48:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1562 transitions. [2024-11-14 05:48:23,931 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1562 transitions. Word has length 64 [2024-11-14 05:48:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:23,931 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1562 transitions. [2024-11-14 05:48:23,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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) [2024-11-14 05:48:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1562 transitions. [2024-11-14 05:48:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:23,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:23,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:48:23,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:48:23,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:48:23,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1579966011, now seen corresponding path program 1 times [2024-11-14 05:48:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:48:23,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137932149] [2024-11-14 05:48:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:48:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:48:25,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:48:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137932149] [2024-11-14 05:48:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137932149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:25,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:48:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067341307] [2024-11-14 05:48:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:48:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:48:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:48:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:48:25,339 INFO L87 Difference]: Start difference. First operand 1147 states and 1562 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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) [2024-11-14 05:48:27,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:34,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:36,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:37,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:39,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:41,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:43,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:45,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:47,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:49,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:51,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:53,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:48:55,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 05:49:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:01,311 INFO L93 Difference]: Finished difference Result 1149 states and 1565 transitions. [2024-11-14 05:49:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:49:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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 64 [2024-11-14 05:49:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:01,315 INFO L225 Difference]: With dead ends: 1149 [2024-11-14 05:49:01,315 INFO L226 Difference]: Without dead ends: 1149 [2024-11-14 05:49:01,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:49:01,316 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 625 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 3672 mSolverCounterSat, 17 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3672 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:01,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1764 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3672 Invalid, 12 Unknown, 0 Unchecked, 35.7s Time] [2024-11-14 05:49:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-14 05:49:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1147. [2024-11-14 05:49:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 834 states have (on average 1.8057553956834533) internal successors, (1506), 1135 states have internal predecessors, (1506), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-14 05:49:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1560 transitions. [2024-11-14 05:49:01,340 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1560 transitions. Word has length 64 [2024-11-14 05:49:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:01,340 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1560 transitions. [2024-11-14 05:49:01,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 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) [2024-11-14 05:49:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1560 transitions. [2024-11-14 05:49:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 05:49:01,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:01,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 05:49:01,342 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-14 05:49:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1915542002, now seen corresponding path program 1 times [2024-11-14 05:49:01,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:49:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405501397] [2024-11-14 05:49:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:49:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:49:02,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:49:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405501397] [2024-11-14 05:49:02,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405501397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860929056] [2024-11-14 05:49:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:02,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:02,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:49:02,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:49:02,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89d4645-c778-491b-a0c9-f8e3cda95e83/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:49:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:02,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:49:03,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:03,014 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 [2024-11-14 05:49:03,304 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:49:03,304 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 [2024-11-14 05:49:03,406 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 [2024-11-14 05:49:03,648 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 22 treesize of output 10 [2024-11-14 05:49:04,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,046 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 [2024-11-14 05:49:04,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,311 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 [2024-11-14 05:49:04,332 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 [2024-11-14 05:49:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:49:04,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:04,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-14 05:49:04,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-14 05:49:04,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_995))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-14 05:49:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860929056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1003638035] [2024-11-14 05:49:04,559 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-14 05:49:04,559 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:49:04,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:49:04,560 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:49:04,560 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:49:10,843 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-14 05:49:11,164 INFO L180 IcfgInterpreter]: Interpretation finished