./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje --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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:53:28,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:53:28,210 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:53:28,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:53:28,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:53:28,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:53:28,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:53:28,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:53:28,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:53:28,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:53:28,280 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:53:28,281 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:53:28,282 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:53:28,282 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:53:28,285 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:53:28,286 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:53:28,286 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:53:28,287 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:53:28,288 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:53:28,288 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:53:28,289 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:53:28,290 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:53:28,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:53:28,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:53:28,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:53:28,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:53:28,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:53:28,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:53:28,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:53:28,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:53:28,311 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:53:28,311 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:53:28,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:53:28,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:53:28,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:53:28,313 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:53:28,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:53:28,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:53:28,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:53:28,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:53:28,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:53:28,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:53:28,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:53:28,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:53:28,322 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:53:28,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:53:28,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:53:28,324 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:53:28,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:53:28,324 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2024-11-09 06:53:28,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:53:28,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:53:28,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:53:28,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:53:28,699 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:53:28,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i Unable to find full path for "g++" [2024-11-09 06:53:31,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:53:31,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:53:31,668 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-09 06:53:31,693 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/data/daaae6f00/1e82c5fef3124567b78437086a63e8d0/FLAG7f196d5c2 [2024-11-09 06:53:31,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/data/daaae6f00/1e82c5fef3124567b78437086a63e8d0 [2024-11-09 06:53:31,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:53:31,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:53:31,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:53:31,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:53:31,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:53:31,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:53:31" (1/1) ... [2024-11-09 06:53:31,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4001b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:31, skipping insertion in model container [2024-11-09 06:53:31,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:53:31" (1/1) ... [2024-11-09 06:53:31,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:53:32,302 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-09 06:53:32,356 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-09 06:53:32,363 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-09 06:53:32,374 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-09 06:53:32,385 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-09 06:53:32,431 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-09 06:53:32,434 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-09 06:53:32,442 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-09 06:53:32,456 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-09 06:53:32,470 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-09 06:53:32,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:53:32,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:53:32,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:53:32,677 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:53:32,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32 WrapperNode [2024-11-09 06:53:32,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:53:32,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:53:32,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:53:32,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:53:32,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,845 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1569 [2024-11-09 06:53:32,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:53:32,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:53:32,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:53:32,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:53:32,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:32,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:33,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:53:33,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:53:33,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:53:33,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:53:33,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (1/1) ... [2024-11-09 06:53:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:53:33,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:53:33,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:53:33,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:53:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:53:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:53:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:53:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:53:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:53:33,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:53:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:53:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:53:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:53:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:53:33,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:53:33,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:53:33,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:53:33,508 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:53:37,413 INFO L? ?]: Removed 1506 outVars from TransFormulas that were not future-live. [2024-11-09 06:53:37,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:53:40,008 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:53:40,008 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 06:53:40,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:53:40 BoogieIcfgContainer [2024-11-09 06:53:40,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:53:40,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:53:40,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:53:40,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:53:40,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:53:31" (1/3) ... [2024-11-09 06:53:40,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca3b52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:53:40, skipping insertion in model container [2024-11-09 06:53:40,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:53:32" (2/3) ... [2024-11-09 06:53:40,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca3b52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:53:40, skipping insertion in model container [2024-11-09 06:53:40,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:53:40" (3/3) ... [2024-11-09 06:53:40,021 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2024-11-09 06:53:40,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:53:40,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-09 06:53:40,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:53:40,143 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;@4f74918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:53:40,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-09 06:53:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 493 states have (on average 2.5192697768762677) internal successors, (1242), 1125 states have internal predecessors, (1242), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:53:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:53:40,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:40,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:53:40,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:53:40,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash 82717235, now seen corresponding path program 1 times [2024-11-09 06:53:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:53:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427312806] [2024-11-09 06:53:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:40,530 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-09 06:53:40,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:53:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427312806] [2024-11-09 06:53:40,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427312806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:40,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:40,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:53:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180285193] [2024-11-09 06:53:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:53:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:53:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:53:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:53:40,580 INFO L87 Difference]: Start difference. First operand has 1134 states, 493 states have (on average 2.5192697768762677) internal successors, (1242), 1125 states have internal predecessors, (1242), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 06:53:42,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:44,857 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-09 06:53:47,433 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-09 06:53:49,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:53:50,426 INFO L93 Difference]: Finished difference Result 1024 states and 1104 transitions. [2024-11-09 06:53:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:53:50,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:53:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:53:50,452 INFO L225 Difference]: With dead ends: 1024 [2024-11-09 06:53:50,452 INFO L226 Difference]: Without dead ends: 1023 [2024-11-09 06:53:50,454 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-09 06:53:50,458 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 936 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 102 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:53:50,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 496 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 745 Invalid, 4 Unknown, 0 Unchecked, 9.7s Time] [2024-11-09 06:53:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-09 06:53:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1020. [2024-11-09 06:53:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 484 states have (on average 2.2024793388429753) internal successors, (1066), 1011 states have internal predecessors, (1066), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:53:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1098 transitions. [2024-11-09 06:53:50,570 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1098 transitions. Word has length 4 [2024-11-09 06:53:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:53:50,571 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1098 transitions. [2024-11-09 06:53:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 06:53:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1098 transitions. [2024-11-09 06:53:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 06:53:50,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:50,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 06:53:50,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:53:50,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:53:50,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 82717236, now seen corresponding path program 1 times [2024-11-09 06:53:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:53:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120063827] [2024-11-09 06:53:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:53:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:50,708 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-09 06:53:50,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:53:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120063827] [2024-11-09 06:53:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120063827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:50,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:50,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:53:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126018750] [2024-11-09 06:53:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:50,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:53:50,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:53:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:53:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:53:50,718 INFO L87 Difference]: Start difference. First operand 1020 states and 1098 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 06:53:52,853 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-09 06:53:54,881 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-09 06:53:57,253 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-09 06:54:00,677 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-09 06:54:02,681 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-09 06:54:04,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:54:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:54:04,429 INFO L93 Difference]: Finished difference Result 1302 states and 1402 transitions. [2024-11-09 06:54:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:54:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 06:54:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:54:04,437 INFO L225 Difference]: With dead ends: 1302 [2024-11-09 06:54:04,437 INFO L226 Difference]: Without dead ends: 1302 [2024-11-09 06:54:04,438 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-09 06:54:04,439 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 470 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 25 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:54:04,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1176 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 840 Invalid, 5 Unknown, 0 Unchecked, 13.6s Time] [2024-11-09 06:54:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-09 06:54:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1150. [2024-11-09 06:54:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 624 states have (on average 2.1634615384615383) internal successors, (1350), 1141 states have internal predecessors, (1350), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:54:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1382 transitions. [2024-11-09 06:54:04,477 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1382 transitions. Word has length 4 [2024-11-09 06:54:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:54:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1382 transitions. [2024-11-09 06:54:04,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-09 06:54:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1382 transitions. [2024-11-09 06:54:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 06:54:04,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:54:04,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 06:54:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:54:04,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:54:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:54:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash 139547541, now seen corresponding path program 1 times [2024-11-09 06:54:04,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:54:04,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806672305] [2024-11-09 06:54:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:54:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:54:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:54:04,522 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-09 06:54:04,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:54:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806672305] [2024-11-09 06:54:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806672305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:54:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:54:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:54:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959918269] [2024-11-09 06:54:04,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:54:04,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:54:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:54:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:54:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:54:04,526 INFO L87 Difference]: Start difference. First operand 1150 states and 1382 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 06:54:06,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:54:08,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:54:10,434 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-09 06:54:12,463 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-09 06:54:14,576 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-09 06:54:16,581 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-09 06:54:18,607 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-09 06:54:20,683 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-09 06:54:22,694 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-09 06:54:24,717 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-09 06:54:26,719 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-09 06:54:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:54:27,064 INFO L93 Difference]: Finished difference Result 2255 states and 2697 transitions. [2024-11-09 06:54:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:54:27,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 06:54:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:54:27,075 INFO L225 Difference]: With dead ends: 2255 [2024-11-09 06:54:27,076 INFO L226 Difference]: Without dead ends: 2255 [2024-11-09 06:54:27,076 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-09 06:54:27,079 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 1008 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:54:27,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1912 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 10 Unknown, 0 Unchecked, 22.4s Time] [2024-11-09 06:54:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2024-11-09 06:54:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1152. [2024-11-09 06:54:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 626 states have (on average 2.159744408945687) internal successors, (1352), 1143 states have internal predecessors, (1352), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:54:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1384 transitions. [2024-11-09 06:54:27,131 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1384 transitions. Word has length 6 [2024-11-09 06:54:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:54:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1384 transitions. [2024-11-09 06:54:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 06:54:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1384 transitions. [2024-11-09 06:54:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:54:27,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:54:27,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:54:27,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:54:27,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:54:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:54:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash -514150250, now seen corresponding path program 1 times [2024-11-09 06:54:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:54:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837353016] [2024-11-09 06:54:27,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:54:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:54:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:54:27,289 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-09 06:54:27,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:54:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837353016] [2024-11-09 06:54:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837353016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:54:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:54:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:54:27,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489703298] [2024-11-09 06:54:27,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:54:27,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:54:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:54:27,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:54:27,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:54:27,293 INFO L87 Difference]: Start difference. First operand 1152 states and 1384 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 06:54:29,427 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-09 06:54:31,470 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-09 06:54:33,474 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-09 06:54:35,485 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-09 06:54:37,949 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-09 06:54:39,957 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-09 06:54:41,985 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-09 06:54:43,990 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-09 06:54:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:54:45,003 INFO L93 Difference]: Finished difference Result 1133 states and 1365 transitions. [2024-11-09 06:54:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:54:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-09 06:54:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:54:45,009 INFO L225 Difference]: With dead ends: 1133 [2024-11-09 06:54:45,009 INFO L226 Difference]: Without dead ends: 1133 [2024-11-09 06:54:45,010 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-09 06:54:45,011 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 975 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 33 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:54:45,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 847 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1344 Invalid, 8 Unknown, 0 Unchecked, 17.6s Time] [2024-11-09 06:54:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-09 06:54:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1129. [2024-11-09 06:54:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 626 states have (on average 2.123003194888179) internal successors, (1329), 1120 states have internal predecessors, (1329), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:54:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1361 transitions. [2024-11-09 06:54:45,038 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1361 transitions. Word has length 11 [2024-11-09 06:54:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:54:45,039 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1361 transitions. [2024-11-09 06:54:45,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 06:54:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1361 transitions. [2024-11-09 06:54:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:54:45,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:54:45,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:54:45,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:54:45,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:54:45,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:54:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash -514150249, now seen corresponding path program 1 times [2024-11-09 06:54:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:54:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559147898] [2024-11-09 06:54:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:54:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:54:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:54:45,166 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-09 06:54:45,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:54:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559147898] [2024-11-09 06:54:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559147898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:54:45,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:54:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:54:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577676812] [2024-11-09 06:54:45,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:54:45,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:54:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:54:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:54:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:54:45,169 INFO L87 Difference]: Start difference. First operand 1129 states and 1361 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 06:54:47,224 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-09 06:54:49,227 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-09 06:54:51,323 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-09 06:54:53,327 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-09 06:54:55,347 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-09 06:54:57,352 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-09 06:54:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:54:57,538 INFO L93 Difference]: Finished difference Result 1101 states and 1331 transitions. [2024-11-09 06:54:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:54:57,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 06:54:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:54:57,544 INFO L225 Difference]: With dead ends: 1101 [2024-11-09 06:54:57,544 INFO L226 Difference]: Without dead ends: 1101 [2024-11-09 06:54:57,545 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-09 06:54:57,546 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 51 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:54:57,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1764 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 6 Unknown, 0 Unchecked, 12.3s Time] [2024-11-09 06:54:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-09 06:54:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2024-11-09 06:54:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 610 states have (on average 2.1295081967213116) internal successors, (1299), 1092 states have internal predecessors, (1299), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:54:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1331 transitions. [2024-11-09 06:54:57,574 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1331 transitions. Word has length 11 [2024-11-09 06:54:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:54:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1331 transitions. [2024-11-09 06:54:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09 06:54:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1331 transitions. [2024-11-09 06:54:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:54:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:54:57,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:54:57,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:54:57,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:54:57,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:54:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1247981024, now seen corresponding path program 1 times [2024-11-09 06:54:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:54:57,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148802911] [2024-11-09 06:54:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:54:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:54:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:54:57,686 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-09 06:54:57,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:54:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148802911] [2024-11-09 06:54:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148802911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:54:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:54:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:54:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973871432] [2024-11-09 06:54:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:54:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:54:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:54:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:54:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:54:57,689 INFO L87 Difference]: Start difference. First operand 1101 states and 1331 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-09 06:54:59,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-09 06:55:01,784 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-09 06:55:03,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:55:05,927 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-09 06:55:07,930 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-09 06:55:09,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:55:11,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:55:13,997 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-09 06:55:16,000 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-09 06:55:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:16,262 INFO L93 Difference]: Finished difference Result 1090 states and 1313 transitions. [2024-11-09 06:55:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-09 06:55:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:16,269 INFO L225 Difference]: With dead ends: 1090 [2024-11-09 06:55:16,269 INFO L226 Difference]: Without dead ends: 1090 [2024-11-09 06:55:16,269 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-09 06:55:16,271 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 38 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:16,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2611 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 9 Unknown, 0 Unchecked, 18.5s Time] [2024-11-09 06:55:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-09 06:55:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1087. [2024-11-09 06:55:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 603 states have (on average 2.1194029850746268) internal successors, (1278), 1078 states have internal predecessors, (1278), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:55:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1310 transitions. [2024-11-09 06:55:16,296 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1310 transitions. Word has length 12 [2024-11-09 06:55:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:16,296 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1310 transitions. [2024-11-09 06:55:16,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-09 06:55:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1310 transitions. [2024-11-09 06:55:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:55:16,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:16,298 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] [2024-11-09 06:55:16,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:16,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:55:16,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash 561812206, now seen corresponding path program 1 times [2024-11-09 06:55:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416179294] [2024-11-09 06:55:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:16,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:16,560 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-09 06:55:16,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416179294] [2024-11-09 06:55:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416179294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:16,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:16,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040657582] [2024-11-09 06:55:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:16,563 INFO L87 Difference]: Start difference. First operand 1087 states and 1310 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-09 06:55:18,624 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-09 06:55:20,629 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-09 06:55:22,631 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-09 06:55:24,972 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-09 06:55:27,245 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-09 06:55:29,250 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-09 06:55:32,180 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-09 06:55:34,205 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-09 06:55:36,212 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-09 06:55:38,216 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-09 06:55:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:38,361 INFO L93 Difference]: Finished difference Result 1239 states and 1330 transitions. [2024-11-09 06:55:38,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:38,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-09 06:55:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:38,367 INFO L225 Difference]: With dead ends: 1239 [2024-11-09 06:55:38,367 INFO L226 Difference]: Without dead ends: 1239 [2024-11-09 06:55:38,367 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-09 06:55:38,368 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 408 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:38,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1557 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1355 Invalid, 10 Unknown, 0 Unchecked, 21.7s Time] [2024-11-09 06:55:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-09 06:55:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1083. [2024-11-09 06:55:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 603 states have (on average 2.112769485903814) internal successors, (1274), 1074 states have internal predecessors, (1274), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:55:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1306 transitions. [2024-11-09 06:55:38,392 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1306 transitions. Word has length 26 [2024-11-09 06:55:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:38,393 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1306 transitions. [2024-11-09 06:55:38,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-09 06:55:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1306 transitions. [2024-11-09 06:55:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 06:55:38,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:38,397 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] [2024-11-09 06:55:38,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:38,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:55:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash 873204422, now seen corresponding path program 1 times [2024-11-09 06:55:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242239997] [2024-11-09 06:55:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:38,618 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-09 06:55:38,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242239997] [2024-11-09 06:55:38,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242239997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062560674] [2024-11-09 06:55:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:38,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:38,622 INFO L87 Difference]: Start difference. First operand 1083 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-09 06:55:40,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:55:42,301 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-09 06:55:44,304 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-09 06:55:46,307 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-09 06:55:48,325 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-09 06:55:50,328 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-09 06:55:52,331 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-09 06:55:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:52,560 INFO L93 Difference]: Finished difference Result 1083 states and 1302 transitions. [2024-11-09 06:55:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:55:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-09 06:55:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:52,566 INFO L225 Difference]: With dead ends: 1083 [2024-11-09 06:55:52,566 INFO L226 Difference]: Without dead ends: 1083 [2024-11-09 06:55:52,566 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-09 06:55:52,567 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 15 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:52,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2599 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 6 Unknown, 0 Unchecked, 13.9s Time] [2024-11-09 06:55:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-09 06:55:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2024-11-09 06:55:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 603 states have (on average 2.1061359867330016) internal successors, (1270), 1074 states have internal predecessors, (1270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:55:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1302 transitions. [2024-11-09 06:55:52,590 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1302 transitions. Word has length 42 [2024-11-09 06:55:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:52,591 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1302 transitions. [2024-11-09 06:55:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-09 06:55:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1302 transitions. [2024-11-09 06:55:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 06:55:52,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:52,593 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] [2024-11-09 06:55:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:55:52,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:55:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash 746182182, now seen corresponding path program 1 times [2024-11-09 06:55:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131341936] [2024-11-09 06:55:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:52,820 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-09 06:55:52,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:52,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131341936] [2024-11-09 06:55:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131341936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248177306] [2024-11-09 06:55:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:52,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:52,825 INFO L87 Difference]: Start difference. First operand 1083 states and 1302 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-09 06:55:54,848 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-09 06:55:56,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:55:58,518 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-09 06:56:00,523 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-09 06:56:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:02,200 INFO L93 Difference]: Finished difference Result 1125 states and 1344 transitions. [2024-11-09 06:56:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-11-09 06:56:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:02,205 INFO L225 Difference]: With dead ends: 1125 [2024-11-09 06:56:02,205 INFO L226 Difference]: Without dead ends: 1125 [2024-11-09 06:56:02,206 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-09 06:56:02,206 INFO L432 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:02,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1748 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 3 Unknown, 0 Unchecked, 9.4s Time] [2024-11-09 06:56:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-09 06:56:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-09 06:56:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 645 states have (on average 2.034108527131783) internal successors, (1312), 1116 states have internal predecessors, (1312), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:56:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1344 transitions. [2024-11-09 06:56:02,232 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1344 transitions. Word has length 46 [2024-11-09 06:56:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:02,232 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1344 transitions. [2024-11-09 06:56:02,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-09 06:56:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1344 transitions. [2024-11-09 06:56:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 06:56:02,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:02,234 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-09 06:56:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:56:02,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:56:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1344502158, now seen corresponding path program 1 times [2024-11-09 06:56:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665895686] [2024-11-09 06:56:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:03,027 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-09 06:56:03,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665895686] [2024-11-09 06:56:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665895686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11578094] [2024-11-09 06:56:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:03,030 INFO L87 Difference]: Start difference. First operand 1125 states and 1344 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 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-09 06:56:05,066 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-09 06:56:07,043 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-09 06:56:09,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-09 06:56:11,432 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-09 06:56:13,436 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-09 06:56:15,488 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-09 06:56:17,492 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-09 06:56:19,496 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-09 06:56:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:20,544 INFO L93 Difference]: Finished difference Result 1041 states and 1260 transitions. [2024-11-09 06:56:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:56:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 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-09 06:56:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:20,549 INFO L225 Difference]: With dead ends: 1041 [2024-11-09 06:56:20,550 INFO L226 Difference]: Without dead ends: 1041 [2024-11-09 06:56:20,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:20,551 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1601 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 104 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:20,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 512 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1380 Invalid, 7 Unknown, 0 Unchecked, 17.5s Time] [2024-11-09 06:56:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-09 06:56:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 901. [2024-11-09 06:56:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 505 states have (on average 1.8495049504950496) internal successors, (934), 892 states have internal predecessors, (934), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:56:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 966 transitions. [2024-11-09 06:56:20,571 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 966 transitions. Word has length 49 [2024-11-09 06:56:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:20,571 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 966 transitions. [2024-11-09 06:56:20,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 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-09 06:56:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 966 transitions. [2024-11-09 06:56:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:56:20,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:20,573 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] [2024-11-09 06:56:20,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:56:20,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:56:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 975108602, now seen corresponding path program 1 times [2024-11-09 06:56:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200531088] [2024-11-09 06:56:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:21,058 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-09 06:56:21,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200531088] [2024-11-09 06:56:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200531088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:21,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701733681] [2024-11-09 06:56:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:21,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:56:21,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:56:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:21,060 INFO L87 Difference]: Start difference. First operand 901 states and 966 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-09 06:56:24,371 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-09 06:56:26,374 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-09 06:56:28,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-09 06:56:30,384 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-09 06:56:32,422 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-09 06:56:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:34,190 INFO L93 Difference]: Finished difference Result 900 states and 965 transitions. [2024-11-09 06:56:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:34,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-11-09 06:56:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:34,202 INFO L225 Difference]: With dead ends: 900 [2024-11-09 06:56:34,204 INFO L226 Difference]: Without dead ends: 900 [2024-11-09 06:56:34,205 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-09 06:56:34,206 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 2 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:34,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2093 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1578 Invalid, 5 Unknown, 0 Unchecked, 13.1s Time] [2024-11-09 06:56:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-09 06:56:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-11-09 06:56:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 505 states have (on average 1.8475247524752476) internal successors, (933), 891 states have internal predecessors, (933), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:56:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 965 transitions. [2024-11-09 06:56:34,238 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 965 transitions. Word has length 53 [2024-11-09 06:56:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:34,238 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 965 transitions. [2024-11-09 06:56:34,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-09 06:56:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 965 transitions. [2024-11-09 06:56:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:56:34,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:34,240 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] [2024-11-09 06:56:34,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:56:34,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:56:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 975108603, now seen corresponding path program 1 times [2024-11-09 06:56:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624197283] [2024-11-09 06:56:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:35,032 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-09 06:56:35,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624197283] [2024-11-09 06:56:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624197283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244109919] [2024-11-09 06:56:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:35,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:56:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:35,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:56:35,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:35,037 INFO L87 Difference]: Start difference. First operand 900 states and 965 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-09 06:56:37,793 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-09 06:56:39,798 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-09 06:56:41,802 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-09 06:56:43,806 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-09 06:56:45,844 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-09 06:56:47,850 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-09 06:56:49,853 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-09 06:56:51,856 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-09 06:56:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:52,936 INFO L93 Difference]: Finished difference Result 899 states and 964 transitions. [2024-11-09 06:56:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:52,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-11-09 06:56:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:52,940 INFO L225 Difference]: With dead ends: 899 [2024-11-09 06:56:52,940 INFO L226 Difference]: Without dead ends: 899 [2024-11-09 06:56:52,941 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-09 06:56:52,942 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 1 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:52,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2108 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1557 Invalid, 8 Unknown, 0 Unchecked, 17.8s Time] [2024-11-09 06:56:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-11-09 06:56:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2024-11-09 06:56:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 504 states have (on average 1.8492063492063493) internal successors, (932), 890 states have internal predecessors, (932), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 06:56:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 964 transitions. [2024-11-09 06:56:52,964 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 964 transitions. Word has length 53 [2024-11-09 06:56:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:52,964 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 964 transitions. [2024-11-09 06:56:52,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-09 06:56:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 964 transitions. [2024-11-09 06:56:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:56:52,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:52,966 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] [2024-11-09 06:56:52,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:56:52,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:56:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2035860512, now seen corresponding path program 1 times [2024-11-09 06:56:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742279305] [2024-11-09 06:56:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:53,400 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-09 06:56:53,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742279305] [2024-11-09 06:56:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742279305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:56:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175014276] [2024-11-09 06:56:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:53,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:56:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:56:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:56:53,405 INFO L87 Difference]: Start difference. First operand 899 states and 964 transitions. Second operand has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-09 06:56:55,465 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-09 06:56:57,467 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-09 06:56:59,472 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-09 06:57:01,475 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-09 06:57:03,478 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-09 06:57:04,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 06:57:07,301 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-09 06:57:09,304 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-09 06:57:11,310 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-09 06:57:13,315 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-09 06:57:15,317 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-09 06:57:17,320 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-09 06:57:19,358 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-09 06:57:21,361 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-09 06:57:23,363 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-09 06:57:25,368 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-09 06:57:27,372 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-09 06:57:29,375 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-09 06:57:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:30,627 INFO L93 Difference]: Finished difference Result 909 states and 980 transitions. [2024-11-09 06:57:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:57:30,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 59 [2024-11-09 06:57:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:30,632 INFO L225 Difference]: With dead ends: 909 [2024-11-09 06:57:30,632 INFO L226 Difference]: Without dead ends: 909 [2024-11-09 06:57:30,633 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-09 06:57:30,633 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 11 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 17 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:30,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2861 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1723 Invalid, 17 Unknown, 0 Unchecked, 37.1s Time] [2024-11-09 06:57:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-09 06:57:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 904. [2024-11-09 06:57:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 508 states have (on average 1.8464566929133859) internal successors, (938), 894 states have internal predecessors, (938), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-09 06:57:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 976 transitions. [2024-11-09 06:57:30,656 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 976 transitions. Word has length 59 [2024-11-09 06:57:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 976 transitions. [2024-11-09 06:57:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-09 06:57:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 976 transitions. [2024-11-09 06:57:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:57:30,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:30,658 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] [2024-11-09 06:57:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:57:30,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:57:30,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2035860513, now seen corresponding path program 1 times [2024-11-09 06:57:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860166285] [2024-11-09 06:57:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:31,573 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-09 06:57:31,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860166285] [2024-11-09 06:57:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860166285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:31,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:31,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:57:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202165079] [2024-11-09 06:57:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:31,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:57:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:57:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:31,579 INFO L87 Difference]: Start difference. First operand 904 states and 976 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-09 06:57:33,637 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-09 06:57:35,640 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-09 06:57:38,866 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-09 06:57:40,870 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-09 06:57:42,875 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-09 06:57:44,879 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-09 06:57:46,890 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-09 06:57:48,939 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-09 06:57:50,944 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-09 06:57:52,947 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-09 06:57:54,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-09 06:57:56,952 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-09 06:57:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:58,346 INFO L93 Difference]: Finished difference Result 904 states and 975 transitions. [2024-11-09 06:57:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:57:58,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 59 [2024-11-09 06:57:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:58,351 INFO L225 Difference]: With dead ends: 904 [2024-11-09 06:57:58,351 INFO L226 Difference]: Without dead ends: 904 [2024-11-09 06:57:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:57:58,352 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 7 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 15 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:58,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2677 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1883 Invalid, 12 Unknown, 0 Unchecked, 26.7s Time] [2024-11-09 06:57:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-09 06:57:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2024-11-09 06:57:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 508 states have (on average 1.844488188976378) internal successors, (937), 894 states have internal predecessors, (937), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-09 06:57:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 975 transitions. [2024-11-09 06:57:58,374 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 975 transitions. Word has length 59 [2024-11-09 06:57:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:58,375 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 975 transitions. [2024-11-09 06:57:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-09 06:57:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 975 transitions. [2024-11-09 06:57:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 06:57:58,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:58,377 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] [2024-11-09 06:57:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:57:58,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 06:57:58,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1419694525, now seen corresponding path program 1 times [2024-11-09 06:57:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479404597] [2024-11-09 06:57:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:59,309 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-09 06:57:59,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479404597] [2024-11-09 06:57:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479404597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257420759] [2024-11-09 06:57:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:59,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:59,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:57:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:59,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:57:59,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:59,900 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:57:59,901 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-09 06:57:59,967 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-09 06:58:00,110 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-09 06:58:00,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:58:00,378 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-09 06:58:00,457 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-09 06:58:00,520 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-09 06:58:00,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257420759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412208874] [2024-11-09 06:58:00,662 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2024-11-09 06:58:00,662 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:58:00,668 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:58:00,677 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:58:00,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:58:06,494 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 06:58:06,871 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:00:28,795 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '31867#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#t~mem52#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~user~0#1.base|) 8)) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) 8)) 1)) (= |ULTIMATE.start_main_~altusers~0#1.base| 0) (= |ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_18|))) (exists ((|v_#memory_int_625| (Array Int (Array Int Int))) (|v_#memory_int_624| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_620| (Array Int (Array Int Int))) (|v_#memory_int_622| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_622|) (= (store |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_625| |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_622| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_624|) (= (store |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_625|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_533| (Array Int (Array Int Int))) (|v_#length_896| (Array Int Int)) (|v_#memory_$Pointer$.base_531| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_530| (Array Int (Array Int Int))) (|v_#valid_914| (Array Int Int))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_531|) (= (select |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (<= 40 (select |v_#length_896| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (select |v_#valid_914| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_533|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_533| |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)))) (= (store |v_#length_896| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (store |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_526| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_527| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_529| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_529| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_529|) (= (store |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_527|)))) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_18| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_18| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_18|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_533| (Array Int (Array Int Int))) (|v_#length_896| (Array Int Int)) (|v_#memory_$Pointer$.base_531| (Array Int (Array Int Int))) (|v_#valid_914| (Array Int Int)) (|v_#memory_$Pointer$.base_530| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| (store |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_533| |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)))) (= |#valid| (store |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1)) (= (store |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_530| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_531|) (= (select |v_#valid_914| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |#length| (store |v_#length_896| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 44)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (<= 40 (select |v_#length_896| |ULTIMATE.start_main_~user~0#1.base|)) (= (select |v_#valid_914| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_2| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_531| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_533| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_533|))) (exists ((|v_#memory_$Pointer$.offset_526| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_527| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_529| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_529| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_529|) (= (store |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_526| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_527| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_527|))) (exists ((|v_#memory_int_625| (Array Int (Array Int Int))) (|v_#memory_int_624| (Array Int (Array Int Int))) (|v_#memory_int_620| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_2| (Array Int (Array Int Int))) (|v_#memory_int_622| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_620| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 28))) |v_#memory_int_622|) (= (store |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_622| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_624|) (= (store |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_624| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base|) 12))) |v_#memory_int_625|) (= |v_old(#memory_int)_AFTER_CALL_2| (store |v_#memory_int_625| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_625| |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)))))))) (= ~count_int_int~0 0))' at error location [2024-11-09 07:00:28,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:00:28,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:00:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 07:00:28,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588139174] [2024-11-09 07:00:28,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:00:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:00:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:00:28,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:00:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2228, Unknown=77, NotChecked=0, Total=2550 [2024-11-09 07:00:28,800 INFO L87 Difference]: Start difference. First operand 904 states and 975 transitions. Second operand has 19 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 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-09 07:00:31,135 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-09 07:00:33,139 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-09 07:00:35,143 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-09 07:00:37,147 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-09 07:00:39,150 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-09 07:00:41,153 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-09 07:00:43,156 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-09 07:00:45,158 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-09 07:00:46,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:53,068 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-09 07:00:55,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:00:57,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-09 07:00:59,096 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-09 07:01:01,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-09 07:01:02,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:01:05,079 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-09 07:01:06,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:01:08,727 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-09 07:01:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:01:21,561 INFO L93 Difference]: Finished difference Result 908 states and 979 transitions. [2024-11-09 07:01:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:01:21,561 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 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 60 [2024-11-09 07:01:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:01:21,564 INFO L225 Difference]: With dead ends: 908 [2024-11-09 07:01:21,564 INFO L226 Difference]: Without dead ends: 908 [2024-11-09 07:01:21,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 142.8s TimeCoverageRelationStatistics Valid=277, Invalid=2616, Unknown=77, NotChecked=0, Total=2970 [2024-11-09 07:01:21,566 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 841 mSDsluCounter, 4306 mSDsCounter, 0 mSdLazyCounter, 6267 mSolverCounterSat, 34 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 4732 SdHoareTripleChecker+Invalid, 6315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6267 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:01:21,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 4732 Invalid, 6315 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6267 Invalid, 14 Unknown, 0 Unchecked, 52.2s Time] [2024-11-09 07:01:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-09 07:01:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 906. [2024-11-09 07:01:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 510 states have (on average 1.8411764705882352) internal successors, (939), 895 states have internal predecessors, (939), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-09 07:01:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 972 transitions. [2024-11-09 07:01:21,597 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 972 transitions. Word has length 60 [2024-11-09 07:01:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:01:21,598 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 972 transitions. [2024-11-09 07:01:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.9375) internal successors, (79), 18 states have internal predecessors, (79), 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-09 07:01:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 972 transitions. [2024-11-09 07:01:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:01:21,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:01:21,601 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] [2024-11-09 07:01:21,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:01:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:01:21,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 07:01:21,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1419694526, now seen corresponding path program 1 times [2024-11-09 07:01:21,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:01:21,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584650847] [2024-11-09 07:01:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,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-09 07:01:23,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:01:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584650847] [2024-11-09 07:01:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584650847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:01:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418921216] [2024-11-09 07:01:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:23,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:01:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:01:23,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:01:23,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:01:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:01:24,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:01:24,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:01:24,371 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-09 07:01:24,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:01:24,511 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-09 07:01:24,540 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-09 07:01:24,888 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-09 07:01:24,900 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-09 07:01:25,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:01:25,313 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-09 07:01:25,334 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-09 07:01:25,497 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-09 07:01:25,517 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-09 07:01:25,613 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-09 07:01:25,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:01:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418921216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:01:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [923458266] [2024-11-09 07:01:26,200 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2024-11-09 07:01:26,200 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:01:26,201 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:01:26,201 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:01:26,201 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:01:32,641 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 128 for LOIs [2024-11-09 07:01:33,115 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:04:11,193 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33930#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (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))) (= |ULTIMATE.start_main_~altusers~0#1.base| 0) (= |ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (or (and (exists ((|v_#Ultimate.C_memset_#t~loopctr309_30| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr309_30|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_30| 4294967296)))) (exists ((|v_#valid_917| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#length_899| (Array Int Int)) (|v_#memory_$Pointer$.base_555| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_553| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_552| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= 0 (select |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| (store |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_555| |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)))) (= (store |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_553|) (<= 40 (select |v_#length_899| |ULTIMATE.start_main_~user~0#1.base|)) (= (store |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_555|) (= (select |v_#valid_917| |ULTIMATE.start_main_~user~0#1.base|) 1) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#length_899| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|) (= (store |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_6| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|))) (exists ((|v_#memory_int_638| (Array Int (Array Int Int))) (|v_#memory_int_643| (Array Int (Array Int Int))) (|v_#memory_int_642| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_640| (Array Int (Array Int Int)))) (and (= |v_#memory_int_643| (store |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base|) 12)))) (= |v_#memory_int_640| (store |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= (store |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_642|) (= (store |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_643| |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))) |v_old(#memory_int)_AFTER_CALL_6|))) (exists ((|v_#memory_$Pointer$.offset_548| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_549| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_551| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_551| (store |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_551| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_549|)))) (and (exists ((|v_#valid_917| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#length_899| (Array Int Int)) (|v_#memory_$Pointer$.base_555| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_553| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_552| (Array Int (Array Int Int)))) (and (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 0)) (= (store |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_552| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.base_553|) (<= 40 (select |v_#length_899| |ULTIMATE.start_main_~user~0#1.base|)) (<= (+ (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.base_553| |ULTIMATE.start_main_~user~0#1.base|) 28 |ULTIMATE.start_main_~user~0#1.base|) 32 (select (select |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.base_555|) (= (select |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8)) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| (store |v_#memory_$Pointer$.base_555| |ULTIMATE.start_main_~user~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_555| |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_917| |ULTIMATE.start_main_~user~0#1.base|) 1) (= (store |v_#valid_917| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 1) |#valid|) (= (store |v_#length_899| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_5| |ULTIMATE.start_main_~user~0#1.base|) 8) 44) |#length|))) (exists ((|v_#memory_$Pointer$.offset_548| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_549| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_551| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_551| (store |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 28 0) 32 (select (select |v_#memory_$Pointer$.offset_551| |ULTIMATE.start_main_~user~0#1.base|) 32)))) (= (store |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_548| |ULTIMATE.start_main_~user~0#1.base|) 36 (select (select |v_#memory_$Pointer$.offset_549| |ULTIMATE.start_main_~user~0#1.base|) 36))) |v_#memory_$Pointer$.offset_549|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr309_30| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr309_30| 4294967296)) (<= 1 |v_#Ultimate.C_memset_#t~loopctr309_30|))) (exists ((|v_#memory_int_638| (Array Int (Array Int Int))) (|v_#memory_int_643| (Array Int (Array Int Int))) (|v_#memory_int_642| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_int_640| (Array Int (Array Int Int)))) (and (= |v_#memory_int_643| (store |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 12 (select (select |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base|) 12)))) (= |v_#memory_int_640| (store |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_638| |ULTIMATE.start_main_~user~0#1.base|) 36 |ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 28)))) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_643| |ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_int_643| |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_640| |ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_640| |ULTIMATE.start_main_~user~0#1.base|) 32 4) 16 (select (select |v_#memory_int_642| |ULTIMATE.start_main_~user~0#1.base|) 16))) |v_#memory_int_642|))))) (= ~count_int_int~0 0))' at error location [2024-11-09 07:04:11,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:04:11,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:04:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-09 07:04:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457421271] [2024-11-09 07:04:11,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:04:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:04:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:04:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:04:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2308, Unknown=93, NotChecked=0, Total=2652 [2024-11-09 07:04:11,197 INFO L87 Difference]: Start difference. First operand 906 states and 972 transitions. Second operand has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 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-09 07:04:18,248 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-09 07:04:20,260 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-09 07:04:22,269 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-09 07:04:24,278 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-09 07:04:26,282 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-09 07:04:28,286 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-09 07:04:29,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:04:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:04:42,419 INFO L93 Difference]: Finished difference Result 907 states and 978 transitions. [2024-11-09 07:04:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:04:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 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 60 [2024-11-09 07:04:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:04:42,423 INFO L225 Difference]: With dead ends: 907 [2024-11-09 07:04:42,423 INFO L226 Difference]: Without dead ends: 907 [2024-11-09 07:04:42,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 160.2s TimeCoverageRelationStatistics Valid=290, Invalid=2693, Unknown=97, NotChecked=0, Total=3080 [2024-11-09 07:04:42,425 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 864 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 52 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:04:42,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2555 Invalid, 5815 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 5757 Invalid, 6 Unknown, 0 Unchecked, 30.5s Time] [2024-11-09 07:04:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-09 07:04:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 900. [2024-11-09 07:04:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 506 states have (on average 1.8438735177865613) internal successors, (933), 890 states have internal predecessors, (933), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 07:04:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 965 transitions. [2024-11-09 07:04:42,447 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 965 transitions. Word has length 60 [2024-11-09 07:04:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:04:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 965 transitions. [2024-11-09 07:04:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.266666666666667) internal successors, (79), 18 states have internal predecessors, (79), 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-09 07:04:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 965 transitions. [2024-11-09 07:04:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:04:42,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:04:42,448 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] [2024-11-09 07:04:42,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:04:42,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 07:04:42,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 07:04:42,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2041167826, now seen corresponding path program 1 times [2024-11-09 07:04:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:04:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997371700] [2024-11-09 07:04:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:43,794 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-09 07:04:43,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:04:43,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997371700] [2024-11-09 07:04:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997371700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:43,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:04:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930458521] [2024-11-09 07:04:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:43,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:04:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:04:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:04:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:04:43,796 INFO L87 Difference]: Start difference. First operand 900 states and 965 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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-09 07:04:46,069 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-09 07:04:48,073 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-09 07:04:49,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:04:54,271 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-09 07:04:55,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:04:58,100 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-09 07:05:00,103 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-09 07:05:02,107 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-09 07:05:04,110 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-09 07:05:06,115 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-09 07:05:08,120 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-09 07:05:09,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:05:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:17,735 INFO L93 Difference]: Finished difference Result 910 states and 981 transitions. [2024-11-09 07:05:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:05:17,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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 61 [2024-11-09 07:05:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:17,740 INFO L225 Difference]: With dead ends: 910 [2024-11-09 07:05:17,740 INFO L226 Difference]: Without dead ends: 910 [2024-11-09 07:05:17,740 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-09 07:05:17,741 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 860 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 4202 mSolverCounterSat, 30 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 4241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4202 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:17,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 3176 Invalid, 4241 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 4202 Invalid, 9 Unknown, 0 Unchecked, 33.5s Time] [2024-11-09 07:05:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-09 07:05:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 907. [2024-11-09 07:05:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 512 states have (on average 1.837890625) internal successors, (941), 896 states have internal predecessors, (941), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-09 07:05:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 974 transitions. [2024-11-09 07:05:17,765 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 974 transitions. Word has length 61 [2024-11-09 07:05:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:17,765 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 974 transitions. [2024-11-09 07:05:17,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 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-09 07:05:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 974 transitions. [2024-11-09 07:05:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:05:17,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:17,767 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] [2024-11-09 07:05:17,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:05:17,767 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 07:05:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2041167825, now seen corresponding path program 1 times [2024-11-09 07:05:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941337982] [2024-11-09 07:05:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:19,423 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-09 07:05:19,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941337982] [2024-11-09 07:05:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941337982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:05:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434833111] [2024-11-09 07:05:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:05:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:05:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:05:19,426 INFO L87 Difference]: Start difference. First operand 907 states and 974 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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-09 07:05:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:05:27,726 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-09 07:05:29,729 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-09 07:05:31,739 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-09 07:05:33,743 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-09 07:05:35,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:05:38,041 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-09 07:05:40,045 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-09 07:05:42,049 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-09 07:05:44,056 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-09 07:05:46,060 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-09 07:05:48,070 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-09 07:05:50,075 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-09 07:05:52,080 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-09 07:05:54,084 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-09 07:06:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:04,754 INFO L93 Difference]: Finished difference Result 909 states and 980 transitions. [2024-11-09 07:06:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:06:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 61 [2024-11-09 07:06:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:04,759 INFO L225 Difference]: With dead ends: 909 [2024-11-09 07:06:04,759 INFO L226 Difference]: Without dead ends: 909 [2024-11-09 07:06:04,759 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-09 07:06:04,760 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 858 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 5497 mSolverCounterSat, 29 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5497 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:04,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 2683 Invalid, 5540 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 5497 Invalid, 14 Unknown, 0 Unchecked, 45.0s Time] [2024-11-09 07:06:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-09 07:06:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2024-11-09 07:06:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 512 states have (on average 1.8359375) internal successors, (940), 896 states have internal predecessors, (940), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-09 07:06:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 973 transitions. [2024-11-09 07:06:04,785 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 973 transitions. Word has length 61 [2024-11-09 07:06:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:04,786 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 973 transitions. [2024-11-09 07:06:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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-09 07:06:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 973 transitions. [2024-11-09 07:06:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 07:06:04,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:04,787 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-09 07:06:04,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:06:04,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 07:06:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1471194485, now seen corresponding path program 1 times [2024-11-09 07:06:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:06:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219205832] [2024-11-09 07:06:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:06,099 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-09 07:06:06,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:06:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219205832] [2024-11-09 07:06:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219205832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461575108] [2024-11-09 07:06:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:06:06,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:06,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ddf6b06-d3bb-43a3-952c-a8493a2ab233/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:06:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:06,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:06:06,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:06,843 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:06:06,844 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-09 07:06:06,956 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-09 07:06:07,208 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-09 07:06:07,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:06:07,560 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-09 07:06:07,833 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:06:07,833 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-09 07:06:07,859 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-09 07:06:07,973 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-09 07:06:07,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:07,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 07:06:08,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_879 (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~mem50#1.base| v_ArrVal_879))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 07:06:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461575108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494214944] [2024-11-09 07:06:08,212 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2024-11-09 07:06:08,212 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:06:08,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:06:08,213 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:06:08,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:06:14,306 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 130 for LOIs [2024-11-09 07:06:15,014 INFO L180 IcfgInterpreter]: Interpretation finished